Evolutionary Markov Chain Monte Carlo
نویسندگان
چکیده
Markov chain Monte Carlo (MCMC) is a popular class of algorithms to sample from a complex distribution. A key issue in the design of MCMC algorithms is to improve the proposal mechanism and the mixing behaviour. This has led some authors to propose the use of a population of MCMC chains, while others go even further by integrating techniques from evolutionary computation (EC) into the MCMC framework. This merging of MCMC and EC leads to a class of algorithms, we call Evolutionary Markov Chain Monte Carlo (EMCMC). In this paper we first survey existing EMCMC algorithms and categorise them in two classes: family-competitive EMCMC and populationdriven EMCMC. Next, we introduce the Elitist Coupled Acceptance rule and the Fitness Ordered Tempering algorithm.
منابع مشابه
Distributed Evolutionary Monte Carlo with Applications to Bayesian Analysis
Sampling from multimodal and high dimensional target distribution posits a great challenge in Bayesian analysis. This paper combines the attractive features of the distributed genetic algorithm and the Markov Chain Monte Carlo, resulting in a new Monte Carlo algorithm Distributed Evolutionary Monte Carlo (DEMC) for real-valued problems. DEMC evolves a population of the Markov chains through gen...
متن کاملBayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements
The determination of evolutionary relationships is a fundamental problem in evolutionary biology. Genome arrangement data is potentially more informative than DNA sequence data for inferring evolutionary relationships among distantly related taxa. We describe a Bayesian framework for phylogenetic inference from mitochondrial genome arrangement data using Markov chain Monte Carlo methods. We app...
متن کاملEVOLUTIONARY MONTE CARLO: APPLICATIONS TO Cp MODEL SAMPLING AND CHANGE POINT PROBLEM
Motivated by the success of genetic algorithms and simulated annealing in hard optimization problems, the authors propose a new Markov chain Monte Carlo (MCMC) algorithm called an evolutionary Monte Carlo algorithm. This algorithm has incorporated several attractive features of genetic algorithms and simulated annealing into the framework of MCMC. It works by simulating a population of Markov c...
متن کاملSystem identification using evolutionary Markov chain Monte Carlo
System identi®cation involves determination of the functional structure of a target system that underlies the observed data. In this paper, we present a probabilistic evolutionary method that optimizes system architectures for the iden-ti®cation of unknown target systems. The method is distinguished from existing evolutionary algorithms (EAs) in that the individuals are generated from a probabi...
متن کامل